The Height of Piecewise-Testable Languages with Applications in Logical Complexity
نویسندگان
چکیده
The height of a piecewise-testable language L is the maximum length of the words needed to define L by excluding and requiring given subwords. The height of L is an important descriptive complexity measure that has not yet been investigated in a systematic way. This paper develops a series of new techniques for bounding the height of finite languages and of languages obtained by taking closures by subwords, superwords and related operations. As an application of these results, we show that FO2pA ̊,Ďq, the two-variable fragment of the first-order logic of sequences with the subword ordering, can only express piecewise-testable properties and has elementary complexity. 1998 ACM Subject Classification F.4.1 Mathematical Logic, F.4.3 Formal Languages, F.3.1 Specifying and Verifying and Reasoning about Programs Digital Object Identifier 10.4230/LIPIcs.CSL.2016.32
منابع مشابه
Alternating Towers and Piecewise Testable Separators
Two languages are separable by a piecewise testable language if and only if there exists no infinite tower between them. An infinite tower is an infinite sequence of strings alternating between the two languages such that every string is a subsequence (scattered substring) of all the strings that follow. For regular languages represented by nondeterministic finite automata, the existence of an ...
متن کاملSeparability by piecewise testable languages is PTime-complete
Piecewise testable languages form the first level of the Straubing-Thérien hierarchy. The membership problem for this level is decidable and testing if the language of a DFA is piecewise testable is NL-complete. The question has not yet been addressed for NFAs. We fill in this gap by showing that it is PSpace-complete. The main result is then the lower-bound complexity of separability of regula...
متن کاملPiecewise Testable Languages and Nondeterministic Automata
A regular language is k-piecewise testable if it is a finite boolean combination of languages of the form Σa1Σ · · ·ΣanΣ, where ai ∈ Σ and 0 ≤ n ≤ k. Given a DFA A and k ≥ 0, it is an NLcomplete problem to decide whether the language L(A) is piecewise testable and, for k ≥ 4, it is coNP-complete to decide whether the language L(A) is k-piecewise testable. It is known that the depth of the minim...
متن کاملar X iv : 1 41 2 . 16 41 v 1 [ cs . F L ] 4 D ec 2 01 4 On k - piecewise testability ( preliminary report )
A language is k-piecewise testable if it is a finite boolean combination of languages of the form Σa1Σ · · ·ΣanΣ, where ai ∈ Σ and 0 ≤ n ≤ k. We investigate the problem, given a minimal DFA recognizing a piecewise testable language, what is the minimal k for which the language is k-piecewise testable? It was shown by Klı́ma and Polák that such a k is bounded by the depth of the minimal DFA. We f...
متن کاملOn Boolean combinations forming piecewise testable languages
A regular language is k-piecewise testable (k-PT) if it is a Boolean combination of languages of the form La1a2...an = Σa1Σa2Σ · · ·ΣanΣ, where ai ∈ Σ and 0≤ n≤ k. Given a finite automaton A , if the language L(A ) is piecewise testable, we want to express it as a Boolean combination of languages of the above form. The idea is as follows. If the language is k-PT, then there exists a congruence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016